Universal composability - PDFSEARCH.IO - Document Search Engine

Universal composability
Results: 55

#	Item
21	Games and the Impossibility of Realizable Ideal Functionality Anupam Datta1 , Ante Derek1 , John C. Mitchell1 , Ajith Ramanathan1 , and Andre Scedrov2 1 Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2007-12-18 01:29:59 Commitment scheme Advantage Ciphertext indistinguishability Secure multi-party computation RSA Semantic security Cryptography Cryptographic protocols Universal composability
22	An Equational Approach to Secure Multi-party Computation∗ Daniele Micciancio† Stefano Tessaro‡ January 12, 2013 Add to Reading List Source URL: cseweb.ucsd.edu Language: English - Date: 2013-09-26 16:14:53 Secure multi-party computation Computing Universal composability Communications protocol Verifiable secret sharing Boolean algebra Π-calculus Consensus Cryptographic protocols Data Information
23	Protocols for Bounded-Concurrent Secure Two-Party Computation in the Plain Model Yehuda Lindell∗ Department of Computer Science Bar-Ilan University Ramat Gan, 52900, Israel Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2006-10-01 16:24:33 Universal composability Zero-knowledge proof Secure two-party computation Communications protocol Commitment scheme Actor model Proof of knowledge IP PP Cryptography Cryptographic protocols Secure multi-party computation
24	Legally Enforceable Fairness in Secure Two-Party Computation∗ Yehuda Lindell† Department of Computer Science Bar-Ilan University, Israel. Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2009-07-16 07:03:28 Key management Secure multi-party computation Secure two-party computation Cheque Digital signature Standard model Random oracle Certificate authority Universal composability Cryptography Cryptographic protocols Public-key cryptography
25	Efficient Fully-Simulatable Oblivious Transfer∗ Yehuda Lindell† Department of Computer Science Bar-Ilan University, Israel. Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 2008-12-21 16:22:00 Oblivious transfer Decisional Diffie–Hellman assumption Commitment scheme Secure multi-party computation Communications protocol Zero-knowledge proof Proof of knowledge Cryptography Cryptographic protocols Universal composability
26	Cryptography for Secure and Private Databases: Enabling Practical Data Access without Compromising Privacy by Matthew Daniel Green Add to Reading List Source URL: spar.isi.jhu.edu Language: English - Date: 2010-02-27 17:25:11 Oblivious transfer ID-based encryption Universal composability Communications protocol Cryptographic protocols Data Information
27	Universally Composable Adaptive Oblivious Transfer Matthew Green Susan Hohenberger Johns Hopkins University Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-09-14 17:22:59 Oblivious transfer Zero-knowledge proof Proof of knowledge Universal composability Communications protocol Public-key cryptography RSA XTR Blind signature Cryptography Cryptographic protocols Commitment scheme
28	An extended abstract of this paper appears in Kaoru Kurosawa (Ed.): Advances in Cryptology ASIACRYPT 2007, volume 4833 of Lecture Notes in Computer Science, pages 265–282, Springer-Verlag, 2007. This is the full versio Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2008-05-02 11:56:16 Commitment scheme Universal composability Oblivious transfer Semantic security RSA Diffie–Hellman key exchange Communications protocol Cipher Cryptography Cryptographic protocols ID-based encryption
29	On Concurrently Secure Computation in the Multiple Ideal Query Model∗ Abhishek Jain‡ Vipul Goyal† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-05-07 10:35:40 Software Universal composability Data Secure multi-party computation Advantage Actor model Ciphertext indistinguishability Adversary model Security parameter Cryptographic protocols Cryptography Computing
30	Complete Characterization of Fairness in Secure Two-Party Computation of Boolean Functions Gilad Asharov∗ Amos Beimel† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-12-16 05:22:34 Secure two-party computation Function Inverse function Universal composability Cryptographic protocols Mathematics Secure multi-party computation

UPDATE